Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus
نویسندگان
چکیده
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus.
منابع مشابه
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus.
متن کاملRefining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کاملUndecidability of BPP Equivalences Revisited
Hüttel [3] gave a proof of the undecidability of BPP equivalences. In this note, we point out some of the flaws in his proof, and provide a new, actually simpler proof. 1 Flaws in Hüttel’s Proof Hüttel [3] proves that all BPP equivalences between ready simulation equivalence and trace equivalence are undecidable by encoding a Minsky machine M into two BPP processes L and L, so that (i) If M hal...
متن کاملBehavioural Equivalence for Infinite Systems - Partially Decidable!
For finite-state systems non-interleaving equivalences are computation-ally at least as hard as interleaving equivalences. In this paper we showthat when moving to infinite-state systems, this situation may changedramatically.We compare standard language equivalence for process description lan-guages with two generalizations based on traditional approaches captur-ing...
متن کاملStatic vs Dynamic Typing for Access Control in Pi-Calculus
Traditional static typing systems for the pi-calculus are built around capability types that control the read/write access rights on channels and describe the type of their payload. While static typing has proved adequate for reasoning on process behavior in typed contexts, dynamic techniques have often been advocated as more effective for access control in distributed/untyped contexts. We stud...
متن کامل